Nonlocal games and XOR games
ثبت نشده
چکیده
In previous lectures, we discussed a few fairly direct connections between quantum information theoretic notions and semidefinite programs. For instance, the semidefinite program associated with an optimization over measurements is quite simple and direct, and if you are familiar with the Choi representation of channels the same can be said about our semidefinite program for optimizing over channels. Similarly, the semidefinite programs for the trace norm and fidelity are straightforward, once you know about the lemma from the previous lecture characterizing 2-by-2 positive semidefinite block operators. In this lecture and the next, we will study an example of a semidefinite programming formulation of a quantum information theoretic notion where the relevance of semidefinite programming is not at all evident from the start—sometimes some work is required (and perhaps some luck as well) before a connection between a particular notion and semidefinite programming becomes apparent.
منابع مشابه
Nonlocal Quantum XOR Games for Large Number of Players
Nonlocal games are used to display differences between classical and quantum world. In this paper, we study nonlocal games with a large number of players. We give simple methods for calculating the classical and the quantum values for symmetric XOR games with onebit input per player, a subclass of nonlocal games. We illustrate those methods on the example of the N-player game (due to Ardehali [...
متن کاملAdvantage of Quantum Strategies in Random Symmetric XOR Games
Non-local games are known as a simple but useful model which is widely used for displaying nonlocal properties of quantum mechanics. In this paper we concentrate on a simple subset of non-local games: multiplayer XOR games with 1-bit inputs and 1-bit outputs which are symmetric w.r.t. permutations of players. We look at random instances of non-local games from this class. We prove a tight bound...
متن کاملQuantum Strategies Are Better Than Classical in Almost Any XOR Game
We initiate a study of random instances of nonlocal games. We show that quantum strategies are better than classical for almost any 2-player XOR game. More precisely, for large n, the entangled value of a random 2-player XOR game with n questions to every player is at least 1.21... times the classical value, for 1− o(1) fraction of all 2-player XOR games.
متن کاملOptimal Robust Self-Testing by Binary Nonlocal XOR Games
Self-testing a quantum apparatus means verifying the existence of a certain quantum state as well as the effect of the associated measuring devices based only on the statistics of the measurement outcomes. Robust (i.e., error-tolerant) self-testing quantum apparatuses are critical building blocks for quantum cryptographic protocols that rely on imperfect or untrusted devices. We devise a genera...
متن کاملCharacterising the Performance of XOR Games and the Shannon Capacity of Graphs
In this Letter we give a set of necessary and sufficient conditions such that quantum players of a two-party XOR game cannot perform any better than classical players. With any such game, we associate a graph and examine its zero-error communication capacity. This allows us to specify a broad new class of graphs for which the Shannon capacity can be calculated. The conditions also enable the pa...
متن کاملExplicit lower and upper bounds on the entangled value of multiplayer XOR games
The study of quantum-mechanical violations of Bell inequalities is motivated by the investigation, and the eventual demonstration, of the nonlocal properties of entanglement. In recent years, Bell inequalities have found a fruitful re-formulation using the language of multiplayer games originating from Computer Science. This paper studies the nonlocal properties of entanglement in the context o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017